Reconstructing Ellipsoids from Projections
نویسندگان
چکیده
منابع مشابه
Reconstructing Ellipsoids from Projections
In this paper we examine the problem of reconstructing a (possibly dynamic) ellipsoid from its (possibly inconsistent) orthogonal silhouette projections. We present a particularly convenient representation of ellipsoids as elements of the vector space of symmetric matrices. The relationship between an ellipsoid and its orthogonal projections in this representation is linear, unlike the standard...
متن کاملReconstructing Ellipsoids from Its Three Projections
In this study, a method for reconstructing ellipsoids from its three projection contours is described. The line integral projection of elipsoid with uniform density is developed for any projection view. Our reconstruction algorithm starts from the detecting projection contours that has elliptic shape. Then three sets of estimated ellipse parameters are used in reconstructing the ellipsoid. The ...
متن کاملReconstructing Plane Sets from Projections
The Göttingen State and University Library provides access to digitized documents strictly for noncommercial educational, research and private purposes and makes no warranty with regard to their use for other purposes. Some of our collections are protected by copyright. Publication and/or broadcast in any form (including electronic) requires prior written permission from the Goettingen Stateand...
متن کاملReconstructing hv-Convex Polyominoes from Orthogonal Projections
Tomography is the area of reconstructing objects from projections. In discrete tomography an object T we wish to reconstruct may be a set of cells of a multidimensional grid. We perform measurements of T , each one involving a projection that determines the number of cells in T on all lines parallel to the projection’s direction. Given a finite number of such measurements, we wish to reconstruc...
متن کاملA decomposition technique for reconstructing discrete sets from four projections
The reconstruction of discrete sets from four projections is in general an NP-hard problem. In this paper we study the class of decomposable discrete sets and give an efficient reconstruction algorithm for this class using four projections. It is also shown that an arbitrary discrete set which is Q-convex along the horizontal and vertical directions and consists of several components is decompo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: CVGIP: Graphical Models and Image Processing
سال: 1994
ISSN: 1049-9652
DOI: 10.1006/cgip.1994.1012